- internal algorithms
- Программирование: внутренние алгоритмы
Универсальный англо-русский словарь. Академик.ру. 2011.
internal algorithms
Смотреть что такое "internal algorithms" в других словарях:
Internal Coordinate Mechanics — ICM stands for Internal Coordinate Mechanics and was first designed and built to predict low energy conformations of biomolecules. ICM also is a programming environment for various tasks in computational structural biology, sequence analysis and… … Wikipedia
Internal sort — An internal sort is any data sorting process that takes place entirely within the main memory of a computer. This is possible whenever the data to be sorted is small enough to all be held in the main memory. For sorting larger datasets, it may be … Wikipedia
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Full text search — In text retrieval, full text search refers to a technique for searching a computer stored document or database. In a full text search, the search engine examines all of the words in every stored document as it tries to match search words supplied … Wikipedia
Solar inverter — Internal view of a solar inverter. A solar inverter or PV inverter is a critical component in a Photovoltaic system. It performs the conversion of the variable DC output of the Photovoltaic (PV) modules into a utility frequency AC current that… … Wikipedia
Linked list — In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the… … Wikipedia
Cluster analysis — The result of a cluster analysis shown as the coloring of the squares into three clusters. Cluster analysis or clustering is the task of assigning a set of objects into groups (called clusters) so that the objects in the same cluster are more… … Wikipedia
Nonlinear dimensionality reduction — High dimensional data, meaning data that requires more than two or three dimensions to represent, can be difficult to interpret. One approach to simplification is to assume that the data of interest lies on an embedded non linear manifold within… … Wikipedia
Cryptographic hash function — A cryptographic hash function (specifically, SHA 1) at work. Note that even small changes in the source input (here in the word over ) drastically change the resulting output, by the so called avalanche effect. A cryptographic hash function is a… … Wikipedia
Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia
